An efficient algorithm to enable path diversity in link state routing networks

1389-1286/$ see front matter 2010 Elsevier B.V doi:10.1016/j.comnet.2010.11.005 ⇑ Corresponding author. E-mail addresses: [email protected] [email protected] (P. Francois), olivier.bonav (O. Bonaventure), [email protected] (S. Cateloin (J.-J. Pansiot). Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the network. Current IP routers only support Equal Cost MultiPath (ECMP) which guarantees that the forwarding paths do not contain loops. However, ECMP provides limited path diversity. In this paper, we present an efficient algorithm that allows routers to enable more path diversity: our algorithm let all routers compute at least the two best first hop distinct paths towards each destination and achieves a good tradeoff between path diversity and overhead. In addition, we propose a multipath routing scheme whose goal is to combine fast rerouting and load balancing loop-free routes. The low overhead of our scheme (no additional signaling messages and low complexity) and the nature of its loop-free rules allow to incrementally deploy it on current IP routers. Using actual, inferred, and generated topologies, we compare our algorithm to existing solutions. 2010 Elsevier B.V. All rights reserved.